Sequence Design to Minimize the Weighted Integrated and Peak Sidelobe Levels
نویسندگان
چکیده
منابع مشابه
An Iterated Greedy Algorithm for Flexible Flow Lines with Sequence Dependent Setup Times to Minimize Total Weighted Completion Time
This paper explores the flexile flow lines where setup times are sequence- dependent. The optimization criterion is the minimization of total weighted completion time. We propose an iterated greedy algorithm (IGA) to tackle the problem. An experimental evaluation is conducted to evaluate the proposed algorithm and, then, the obtained results of IGA are compared against those of some other exist...
متن کاملSequential Design of Computer Experiments to Minimize Integrated Response Functions
In the last ten to fifteen years many phenomena that could only be studied using physical experiments can now be studied by computer experiments. Advances in the mathematical modeling of many physical processes, in algorithms for solving mathematical systems, and in computer speeds, have combined to make it possible to replace some physical experiments with computer experiments. In a computer e...
متن کاملA Novel B and B Algorithm for a Unrelated Parallel Machine Scheduling Problem to Minimize the Total Weighted Tardiness
This paper presents a scheduling problem with unrelated parallel machines and sequencedependent setup times that minimizes the total weighted tardiness. A new branch-and-bound (B and B) algorithm is designed incorporating the lower and upper bounding schemes and several dominance properties. The lower and upper bounds are derived through an assignment problem and the composite dispatching rule ...
متن کاملLinear Precoder Design To Minimize Peak To Average Power Ratio (PAPR) For MIMO-OFDM System
We propose a direct precoding plan for a solitary client numerous input–multiple-yield Orthogonal Frequency Division Multiplexing (OFDM) framework to minimize top to normal force degree (PAPR) by utilizing repetitive spatial assets at the transmitter through a particular worth decay based summed up converse. The proposed precoder focused around the summed up converse is made out of two sections...
متن کاملImproved bounds on the peak sidelobe level of binary sequences
Schmidt proved in 2014 that if ε > 0, almost all binary sequences of length n have peak sidelobe level between ( √ 2 − ε)√n log n and ( √ 2 + ε) √ n log n. Because of the small gap between his upper and lower bounds, it is difficult to find improved upper bounds that hold for almost all binary sequences. In this note, we prove that if ε > 0, then almost all binary sequences of length n have pea...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Signal Processing
سال: 2016
ISSN: 1053-587X,1941-0476
DOI: 10.1109/tsp.2015.2510982